Generalised Sifting in Black-Box Groups
نویسندگان
چکیده
منابع مشابه
J un 2 00 5 GENERALISED SIFTING IN BLACK - BOX GROUPS
We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group orders. Our procedure is a Monte Carlo algorithm, and is presented and analysed in the context of black-box groups. It is based on a chain of subsets instead of a...
متن کامل2 1 Ja n 20 05 GENERALISED SIFTING IN BLACK - BOX GROUPS
We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group orders. Our procedure is a Monte Carlo algorithm, and is presented and analysed in the context of black-box groups. It is based on a chain of subsets instead of a...
متن کاملConstructive membership in black-box groups
We present an algorithm to reduce the constructive membership problem for a black-box group G to three instances of the same problem for involution centralisers in G. If G is a simple group of Lie type in odd characteristic, then this reduction can be performed in (Monte Carlo) polynomial time.
متن کاملCentralisers of Involutions in Black Box Groups
We discuss basic structural properties of finite black box groups. A special emphasis is made on the use of centralisers of involutions in probabilistic recognition of black box groups. In particular, we suggest an algorithm for finding the p-core of a black box group of odd characteristic. This special role of involutions suggest that the theory of black box groups reproduces, at a non-determi...
متن کاملRecognising simplicity of black-box groups
We investigate the complexity of computing involutions and their centralizers in groups of Lie type over finite fields of odd order, and discuss applications to the problem of deciding whether a matrix group, or a black-box group of known characteristic, is simple. We show that if the characteristic is odd, then simplicity can be recognised in Monte Carlo polynomial time. Mathematics Subject Cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2005
ISSN: 1461-1570
DOI: 10.1112/s1461157000000978